Hybrid Schema Matching (HSM): Schema Matching Algorithm for Integrating Geographic Information
نویسندگان
چکیده
منابع مشابه
An Improved Semantic Schema Matching Approach
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...
متن کاملA Generic Algorithm for Heterogeneous Schema Matching
Schema matching is a basic problem nowadays in many application areas, such as data integration, data warehouse and e-business. In this paper, we propose a generic schema matching method called GSM (Generic Schema Matching) and its optimizing approaches. GSM provides an extensible library of match algorithms to support multi-strategy matching approach. It also uses a mapping knowledge base to l...
متن کاملSchema label normalization for improving schema matching
Schema matching is the problem of finding relationships among concepts across heterogeneous data sources that are heterogeneous in format and in structure. Starting from the “hidden meaning” associated with schema labels (i.e. class/attribute names) it is possible to discover relationships among the elements of different schemata. Lexical annotation (i.e. annotation w.r.t. a thesaurus/lexical r...
متن کاملSchema Normalization for Improving Schema Matching
Schema matching is the problem of finding relationships among concepts across heterogeneous data sources (heterogeneous in format and in structure). Starting from the “hidden meaning” associated to schema labels (i.e. class/attribute names) it is possible to discover relationships among the elements of different schemata. Lexical annotation (i.e. annotation w.r.t. a thesaurus/lexical resource) ...
متن کاملEfficient Second-Order Predicate Schema Matching Algorithm
A schema is an abstracted or a generalized knowledge to help with solving problems. A second-order predicate schema matching is a problem of computing the matchers of a pair 〈P, p〉 such that P is a second-order predicate schema and p is a first order closed formula. The second-order matching is known as NP-complete,in general. We propose a new matching algorithm based on the pre-checking of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KIPS Transactions on Software and Data Engineering
سال: 2013
ISSN: 2287-5905
DOI: 10.3745/ktsde.2013.2.3.173